Convergence rate for spectral distribution of addition of random matrices

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spectral Distribution of Pseudo-random Matrices

In the previous century, much work has been done on the spectra of random matrices. However, not much is known about the spectra of matrices formed from pseudo-random sequences. In this talk, I will discuss some of our recent results (jointly with Behtash Babadi) in this direction. First, we consider a binary linear block code C of length N , dimension k and minimum Hamming distance d over GF(2...

متن کامل

On the Convergence Rate of the Law of Large Numbers for Sums of Dependent Random Variables

In this paper, we generalize some results of Chandra and Goswami [4] for pairwise negatively dependent random variables (henceforth r.v.’s). Furthermore, we give Baum and Katz’s [1] type results on estimate for the rate of convergence in these laws.

متن کامل

Addition of Free Unitary Random Matrices

We consider a new class of non–hermitian random matrices, namely the ones which have the form of sums of freely independent terms which involve unitary matrices. After deriving some general identities describing additive properties of unitary matrices, we solve three particular models: CUE plus CUE, CUE plus . . . plus CUE (i. e. the sum of an arbitrary number of CUE matrices), and CUE plus a r...

متن کامل

on the convergence rate of the law of large numbers for sums of dependent random variables

in this paper, we generalize some results of chandra and goswami [4] for pairwise negatively dependent random variables (henceforth r.v.’s). furthermore, we give baum and katz’s [1] type results on estimate for the rate of convergence in these laws.

متن کامل

Spectral radii of sparse random matrices

We establish bounds on the spectral radii for a large class of sparse random matrices, which includes the adjacency matrices of inhomogeneous Erdős-Rényi graphs. For the Erdős-Rényi graph G(n, d/n), our results imply that the smallest and second-largest eigenvalues of the adjacency matrix converge to the edges of the support of the asymptotic eigenvalue distribution provided that d log n. Toget...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Mathematics

سال: 2017

ISSN: 0001-8708

DOI: 10.1016/j.aim.2017.08.028